Scaled Coupled Norms and Coupled Higher-Order Tensor Completion
نویسندگان
چکیده
منابع مشابه
Generalized Higher-Order Orthogonal Iteration for Tensor Decomposition and Completion
Low-rank tensor estimation has been frequently applied in many real-world problems. Despite successful applications, existing Schatten 1-norm minimization (SNM) methods may become very slow or even not applicable for large-scale problems. To address this difficulty, we therefore propose an efficient and scalable core tensor Schatten 1-norm minimization method for simultaneous tensor decompositi...
متن کاملGeneralised Coupled Tensor Factorisation
We derive algorithms for generalised tensor factorisation (GTF) by building upon the well-established theory of Generalised Linear Models. Our algorithms are general in the sense that we can compute arbitrary factorisations in a message passing framework, derived for a broad class of exponential family distributions including special cases such as Tweedie’s distributions corresponding to βdiver...
متن کاملA Coupled Higher-Order Nonlinear Schrödinger Equation Including Higher-Order Bright and Dark Solitons
We suggest a generalized Lax pair on a Hermitian symmetric space to generate a new coupled higher-order nonlinear Schrödinger equation of a dual type which contains both bright and dark soliton equations depending on parameters in the Lax pair. Through the generalized ways of reduction and the scaling transformation for the coupled higher-order nonlinear Schrödinger equation, two integrable typ...
متن کاملFrom Tensor to Coupled Matrix/Tensor Decomposition
Decompositions of higher-order tensors are becoming more and more important in signal processing, data analysis, machine learning, scientific computing, optimization and many other fields. A new trend is the study of coupled matrix/tensor decompositions (i.e., decompositions of multiple matrices and/or tensors that are linked in one or several ways). Applications can be found in various fields ...
متن کاملScaled Nuclear Norm Minimization for Low-Rank Tensor Completion
Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in recovering a low-Tucker-rank sampled tensor. In this paper, we propose to recover a low-TT-rank sampled tensor by minimizing a weighted sum of nuclear norms o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2020
ISSN: 0899-7667,1530-888X
DOI: 10.1162/neco_a_01254